RAGE - A rapid graphlet enumerator for large networks
نویسندگان
چکیده
Article history: Received 18 February 2011 Received in revised form 4 July 2011 Accepted 25 August 2011 Available online xxxx
منابع مشابه
A Fast Sampling Method of Exploring Graphlet Degrees of Large Directed and Undirected Graphs
Exploring small connected and induced subgraph patterns (CIS patterns, or graphlets) has recently attracted considerable attention. Despite recent efforts on computing the number of instances a specific graphlet appears in a large graph (i.e., the total number of CISes isomorphic to the graphlet), little attention has been paid to characterizing a node’s graphlet degree, i.e., the number of CIS...
متن کاملGraphlet-based measures are suitable for biological network comparison
MOTIVATION Large amounts of biological network data exist for many species. Analogous to sequence comparison, network comparison aims to provide biological insight. Graphlet-based methods are proving to be useful in this respect. Recently some doubt has arisen concerning the applicability of graphlet-based measures to low edge density networks-in particular that the methods are 'unstable'-and f...
متن کاملA contribution to acceleration of graphlet counting
Graphlets are small non-isomorphic connected subgraphs used for different kinds of analyses in social networks, bioinformatics and other areas described by large networks, where their number can provide a characterization of the network properties. Much of existing methods for counting the graphlets are based on direct enumeration. However, in case of large networks, this type of counting becom...
متن کاملEstimation of Graphlet Statistics
Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks. Despite their practical importance, graphlets have been severely limited to applications and domains with relatively small graphs. Most previous work has focused on exact algorithms, however, it is often too expensive to compute graphlets exactly in massive networks with billion...
متن کاملBiological network comparison using graphlet degree distribution
MOTIVATION Analogous to biological sequence comparison, comparing cellular networks is an important problem that could provide insight into biological understanding and therapeutics. For technical reasons, comparing large networks is computationally infeasible, and thus heuristics, such as the degree distribution, clustering coefficient, diameter, and relative graphlet frequency distribution ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 56 شماره
صفحات -
تاریخ انتشار 2012